The Soundness of Explicit Substitution with Nameless Variables

نویسنده

  • Fairouz Kamareddine
چکیده

We show the soundness of a-calculus B where de Bruijn indices are used, substitution is explicit, and reduction is step-wise. This is done by interpreting B in the classical calculus where the explicit substitution becomes implicit and de Bruijn indices become named variables. This is the rst at semantics of explicit substitution and step-wise reduction and the rst clear account of exactly when-reduction is needed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Substitutions for Contextual Type Theory

In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound variables and meta-variables. Its typing discipline is derived from contextual modal type theory. We first present a dependently typed lambda calculus with explicit substitutions for ordinary variables and explicit meta-substitutions for meta-variables. We then present a weak head normalizatio...

متن کامل

Nominal Reasoning Techniques in Coq ( Extended Abstract ) Brian

We explore an axiomatized nominal approach to variable binding in Coq, using an untyped lambda-calculus as our test case. In our nominal approach, alpha-equality of lambda terms coincides with Coq’s builtin equality. Our axiomatization includes a nominal induction principle and functions for calculating free variables and substitution. These axioms are collected in a module signature and proved...

متن کامل

Nominal Reasoning Techniques in Coq

We explore an axiomatized nominal approach to variable binding in Coq, using an untyped lambda-calculus as our test case. In our nominal approach, alpha-equality of lambda terms coincides with Coq’s builtin equality. Our axiomatization includes a nominal induction principle and functions for calculating free variables and substitution. These axioms are collected in a module signature and proved...

متن کامل

Nominal Reasoning Techniques in Coq ( Extended Abstract ) Brian Aydemir

We explore an axiomatized nominal approach to variable binding in Coq, using an untyped lambda-calculus as our test case. In our nominal approach, alpha-equality of lambda terms coincides with Coq’s builtin equality. Our axiomatization includes a nominal induction principle and functions for calculating free variables and substitution. These axioms are collected in a module signature and proved...

متن کامل

Corollary 3.1 (strong Normalization) Every Term M of C ?

25 4] M. Felleisen, The calculi of v-CS conversion: a syntactic theory of control and state in imperative higher order programming languages, The Strong Normalization theorem turns now to be a corollary of the Soundness theorem. strongly normalizes. Proof. Let us consider the identical substitution id on M, deened by id(x) = x for any x free in M. id is computable because x A 2 A] by C0. Theref...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1998